Pregroup Analysis of Persian Sentences
نویسنده
چکیده
We use Pregroups to provide an algebraic analysis of Persian sentences. Our analysis hints to some of the profound and subtle properties of the Persian grammar, e.g. similarity of its parsing patterns to Hindi (both descendants of of Sanskrit) and similarity in parsing patterns of its causal subordinate and relative sentences. These findings are facilitated by the use of reduction diagrams, a fragment of the ones used in Compact Closed Categories, and two quantitative degrees introduced on them. As our final examples show and interestingly enough, our analysis also lends itself to the Persian of Omar Khayyam and Hafiz, two well known Persian poets of 12th and 14th centuries A.D., respectively. The analysis of the Persian compound verb is left for future work.
منابع مشابه
Fully Lexicalized Pregroup Grammars
Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...
متن کاملAn Algebraic Approach to French Sentence Structure
We propose to investigate the structure of French sentences with the help of a minimal algebraic technique based on the assignment of types to words. Mathematically speaking, the types are elements of the free “pregroup” (a generalization of a partially ordered group) generated by a partially ordered set of basic types. In particular, this partial order is carefully adjusted to account for the ...
متن کاملA Pregroup Grammar for Chord Sequences
In 1984, Mark STEEDMAN [7] proposed a generative grammar based on six context sensitive rewriting rules able to produce a large variety of blues chord sequences. Later, François PACHET [6] developed a method for analyzing jazz chord sequences. Then, Marc CHEMILLER [4] [5] uses STEEDMAN’s grammar to compose by computers jazz music based upon chord sequences generated by this grammar. About twent...
متن کاملTowards Discourse Representation via Pregroup Grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is independent of the order of the associated logic. Lexical entries are read as expressions in a two sorted predicate logic with ∈ and functional symbols. The parsing of a sentence defines a substitution that combines the...
متن کاملA Compositional Distributional Model of Meaning
We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, namely Lambek’s pregroup semantics. A key observation is that the monoidal category of (finite dimensional) vector spaces, linear maps and the tensor product, as well as any pregroup, are examples of compact closed categ...
متن کامل